package o6mergeList;

/**
 * @author shkstart
 * @create 2021-12-30-20:52
 */

/*
*
* 按照从大到小的顺序合并两个链表
*
* */
public class MergeList {

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null) {
            return l2;
        }
        if(l2 == null) {
            return l1;
        }

        if(l1.val < l2.val) {
            l1.next = mergeTwoLists(l1.next, l2);
            return l1;
        } else {
            l2.next = mergeTwoLists(l1, l2.next);
            return l2;
        }
    }
}
